package 力扣_简单题;

/**
 * @author 连安利
 * @version 1.0
 * @date 2021/3/20 16:41
 */
public class 合并两个有序链表 {
    public static ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if(l1 == null){
            return l2;
        }
        else if(l2 == null){
            return l1;
        }
        else if(l1.val < l2.val){
            l1.next = mergeTwoLists(l1.next , l2);
            return l1;
        }
        else{
            l2.next = mergeTwoLists(l1 , l2.next);
            return l2;
        }
    }

}
